Partial servicing of on-line jobs
نویسندگان
چکیده
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower bounds on the competitive ratio and present algorithms for jobs with varying sizes and for jobs with uniform size, and for jobs that can be run for an arbitrary time or only for some fixed fraction of their full execution time. 2000 Mathematics Subject Classification: 68M20,90B35 1998 ACM Computing Classification System: F.2.2.
منابع مشابه
Solving the selective multi-category parallel-servicing problem
In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server (machine) with limited capacity. Each job requests service in a prespecified time window and belon...
متن کاملFlipping the priority: effects of prioritising HTC jobs on energy consumption in a multi-use cluster
High Throughput Computing (HTC) through the use of volunteer computing provides a compelling opportunity to perform large volumes of computation without the need to invest in computational resources. This relies on the good will of computer owners who volunteer their computer idle time. In scenarios when there is contention the HTC system will relinquish the computer – normally achieved through...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملA Non-exponential Queueing System with Batch Servicing
A finite source queueing system is studied in which jobs generated by a source arrive independently but are served in a batch manner. The servicing includes source interdependencies. The input and service distributions are allowed to be generally distributed. A nonstandard product form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. ...
متن کاملA Dynamic Fuzzy Expert System Based on Maintenance Indicators for Service Type Selection of Machinery
Due to the multiplicity of standards and complex rules; maintenance, repair and servicing of machinery could be done only by the fully qualified and proficient experts. Since the knowledge of such experts is not available all times, using expert systems can help to improve the maintenance process. To address this need and the uncertainty of the maintenance process indicators, this research prop...
متن کامل